Deflection routing in hypercube networks
نویسندگان
چکیده
An approximate analysis of the transient and steady state behavior of deflection routing in hypercube networks is presented, under a uniform traffic model. In deflection routing congestion causes packets admitted to the network to be temporarily misrouted rather than buffered or dropped. Our approximations show that deflection routing performs remarkably well in hypercube networks, for small as well as large networks and for the whole range from light to heavy load. Simulations suggest that the approximations are quite accurate.
منابع مشابه
November 1992 LIDS - P - 2149 Performance of Hypercube Routing Schemes With or Without
We consider two different hypercube routing schemes, which we call the simple and the proerity scheroew We evaluate the throughput of both the unbuffered and the buffered version of these Lchems fosr 4rrdom multiple node to node communications. The results obtained are approximate, but very accurate as simulation results indicate, and are given in particularly interesting forms. We find that li...
متن کاملParallel routing in exchanged hypercubes
Parallel routing and diameter are two important issues in interconnection networks. The hypercube is one of the most popular interconnection networks for parallel systems due to its attractive properties such as low diameter and efficient parallel routing. The exchanged hypercube, which is a variant of the hypercube by removing some specific edges, remains several desirable properties of the hy...
متن کاملDeflection Routing Strategies for Optical Burst Switching Networks: Contemporary Affirmation of the Recent Literature
A promising option to raising busty interchange in system communication could be Optical Burst Switched (OBS) networks among scalable and support routing effective. The routing schemes with disputation resolution got much interest, because the OBS network is buffer less in character. Because the deflection steering can use limited optical buffering or actually no buffering thus the choice or de...
متن کاملOptimal Core Selection for Multicast Tree Routing in Hypercube Networks
This paper proposes a set of novel efficient fault-tolerant multicast routing algorithms on hypercube networks using shared tree routing approach. The algorithms can select an optimal core (root) for constructing the shared tree so as to minimize the average delay for multicast messages. Simulation results indicate that our algorithms are efficient as compared with the existing multicast algori...
متن کاملMultiple Reduced Hypercube(MRH): A New Interconnection Network Reducing Both Diameter and Edge of Hypercube
In this paper, Multiple Reduced Hypercube(MRH), which is a new interconnection network based on a hypercube interconnection network, is suggested. Also, this paper demonstrates that MRH(n) proposed in this study is superior to the previously proposed hypercube interconnection networks and the hypercube transformation interconnection networks in terms of network cost(diameter x degree). In addit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Communications
دوره 40 شماره
صفحات -
تاریخ انتشار 1992